Bottleneck partial-matching Voronoi diagrams and applications
نویسندگان
چکیده
منابع مشابه
Bottleneck Partial-Matching Voronoi Diagrams and Applications
Given two point sets in the plane, we study the minimization of the bottleneck distance between a point set B and an equallysized subset of a point set A under translations. We relate this problem to a Voronoi-type diagram and derive polynomial bounds for its complexity that are optimal in the size of A. We devise efficient algorithms for the construction of such a diagram and its lexicographic...
متن کاملBottleneck Partial-Matching Voronoi Diagrams
Given two point sets in the plane, we study the minimization of the (lexiocographic) bottleneck distance between the smaller set and an equally-sized subset of the larger set under translations. We relate this problem to two Voronoi-type diagrams, which are of interest for related problems. Their complexity is shown to be polynomial in the sizes of the sets and algorithms for their construction...
متن کاملBregman Voronoi Diagrams: Properties, Algorithms and Applications
The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define many variants of Voronoi diagrams depending on the class of objects, the distance functions and the embedding space. In this paper, we investigate a framework...
متن کاملL∞ Voronoi Diagrams and Applications to VLSI Layout and Manufacturing
In this paper we address the L∞ Voronoi diagram of polygonal objects and present applications in VLSI layout and manufacturing. We show that in L∞ the Voronoi diagram of segments consists only of straight line segments and is thus much simpler to compute than its Euclidean counterpart. Moreover, it has a natural interpretation. In applications where Euclidean precision is not particularly impor...
متن کاملSpatial Tessellations - Concepts and Applications of Voronoi Diagrams
This book is absolutely necessary reading for anyone concerned with the likely future directions of the spatial sciences. I think it indicates the arrival, or coming of age, of something of a revolution that has been developing for several years within GIS and related disciplines. In their simplest form. Voronoi diagrams of point data sets partition space into a series of tiles, one for each po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2016
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2015.10.001